GPU-BLAST: using graphics processors to accelerate protein sequence alignment

نویسندگان

  • Panagiotis D. Vouzis
  • Nikolaos V. Sahinidis
چکیده

MOTIVATION The Basic Local Alignment Search Tool (BLAST) is one of the most widely used bioinformatics tools. The widespread impact of BLAST is reflected in over 53,000 citations that this software has received in the past two decades, and the use of the word 'blast' as a verb referring to biological sequence comparison. Any improvement in the execution speed of BLAST would be of great importance in the practice of bioinformatics, and facilitate coping with ever increasing sizes of biomolecular databases. RESULTS Using a general-purpose graphics processing unit (GPU), we have developed GPU-BLAST, an accelerated version of the popular NCBI-BLAST. The implementation is based on the source code of NCBI-BLAST, thus maintaining the same input and output interface while producing identical results. In comparison to the sequential NCBI-BLAST, the speedups achieved by GPU-BLAST range mostly between 3 and 4. AVAILABILITY The source code of GPU-BLAST is freely available at http://archimedes.cheme.cmu.edu/biosoftware.html.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

G-BLASTN: accelerating nucleotide alignment by graphics processors

MOTIVATION Since 1990, the basic local alignment search tool (BLAST) has become one of the most popular and fundamental bioinformatics tools for sequence similarity searching, receiving extensive attention from the research community. The two pioneering papers on BLAST have received over 96 000 citations. Given the huge population of BLAST users and the increasing size of sequence databases, an...

متن کامل

Accelerating Protein Structure Prediction using Particle Swarm Optimization on GPU

Protein tertiary structure prediction (PSP) is one of the most challenging problems in bioinformatics. Different methods have been introduced to solve this problem so far, but PSP is computationally intensive and belongs to the NP-hard class. One of the best solutions to accelerate PSP is the use of a massively parallel processing architecture, such graphical processing unit (GPU), which is use...

متن کامل

Empirical Analysis and Performance Evaluation of various GPU Implementations of Protein BLAST

Bioinformatics applications are compute and data intensive by nature. As the size of molecular databases is growing from day to day experiments performed in the field of molecular biology, thoughtful steps need to be taken to exploit various methods to accelerate bioinformatics applications. Many efforts have already been put in the field to optimize most of the bioinformatics algorithms. By in...

متن کامل

QuickProbs—A Fast Multiple Sequence Alignment Algorithm Designed for Graphics Processors

Multiple sequence alignment is a crucial task in a number of biological analyses like secondary structure prediction, domain searching, phylogeny, etc. MSAProbs is currently the most accurate alignment algorithm, but its effectiveness is obtained at the expense of computational time. In the paper we present QuickProbs, the variant of MSAProbs customised for graphics processors. We selected the ...

متن کامل

Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors

Finding regions of similarity between two very long data streams is a computationally intensive problem referred to as sequence alignment. Alignment algorithms must allow for imperfect sequence matching with different starting locations and some gaps and errors between the two data sequences. Perhaps the most well known application of sequence matching is the testing of DNA or protein sequences...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2011